package leetcode.动态规划;

import java.util.Arrays;

public class Leetcode300 {
    public int lengthOfLIS(int[] nums) {
        int n = nums.length;
        int[] dp = new int[n];
        Arrays.fill(dp,1);//默认一个就是一个最长序列
        int res = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if(nums[i]>nums[j]){
                    dp[i] = Math.max(dp[i],dp[j]+1);
                }

            }
            res = Math.max(res,dp[i]);
        }
        return res;
    }
}
